Add to ORKGInternational audienceImplicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of computation, and by internalizing the bounds rather than using external measure. We survey how automata theory contributed to complexity with a machine-dependant with implicit bounds model
This thesis examines the nature of complexity in automata networks, andin particular, the necessary ...
In a recent paper, the author has shown how Interaction Graphs models for linear logic can be used t...
International audienceRecursive analysis is a model of analog computation which is based on type 2 T...
International audienceImplicit Computational Complexity makes two aspects implicit, by manipulating ...
International audienceThis special issue of ACM Transactions on Computational Logic is devoted to Im...
During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit co...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
International audienceWe propose to consider non confluence with respect to implicit complexity. We ...
Shallit and Wang showed that the automatic complexity $A(x)$ satisfies $A(x)\ge n/13$ for almost all...
AbstractLet Σ and Δ be finite alphabets, and let ƒ be a map from Σ∗ to Δ. Then the deterministic aut...
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
Complexity theory helps us predict and control resources, usually time and space, consumed by progra...
AbstractFinite automata are probably best known for being equivalent to right-linear context-free gr...
International audienceThe λ-calculus is a peculiar computational model whose definition does not com...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
This thesis examines the nature of complexity in automata networks, andin particular, the necessary ...
In a recent paper, the author has shown how Interaction Graphs models for linear logic can be used t...
International audienceRecursive analysis is a model of analog computation which is based on type 2 T...
International audienceImplicit Computational Complexity makes two aspects implicit, by manipulating ...
International audienceThis special issue of ACM Transactions on Computational Logic is devoted to Im...
During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit co...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
International audienceWe propose to consider non confluence with respect to implicit complexity. We ...
Shallit and Wang showed that the automatic complexity $A(x)$ satisfies $A(x)\ge n/13$ for almost all...
AbstractLet Σ and Δ be finite alphabets, and let ƒ be a map from Σ∗ to Δ. Then the deterministic aut...
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
Complexity theory helps us predict and control resources, usually time and space, consumed by progra...
AbstractFinite automata are probably best known for being equivalent to right-linear context-free gr...
International audienceThe λ-calculus is a peculiar computational model whose definition does not com...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
This thesis examines the nature of complexity in automata networks, andin particular, the necessary ...
In a recent paper, the author has shown how Interaction Graphs models for linear logic can be used t...
International audienceRecursive analysis is a model of analog computation which is based on type 2 T...